Choice number of 3-colorable elementary graphs
نویسندگان
چکیده
منابع مشابه
Choice number of 3-colorable elementary graphs
We show that the choice number of a graph G is equal to its chromatic number when G belongs to a restricted class of claw-free graphs, in view of the conjecture that this is true for every claw-free graph. We consider only finite, undirected graphs, without loops. Given a graph G = ( V, E), a k-coloring of the vertices of G is a mapping c : V + { 1,2,. . , k} such that for every edge my of G we...
متن کاملColoring 3-Colorable Graphs
Graph coloring in general is an extremely easy-to-understand yet powerful tool. It has wide-ranging applications from register allocation to image segmentation. For such a simple problem, however, the question is surprisingly intractable. In this section I will introduce the problem formally, as well as present some general background on graph coloring. There are several ways to color a graph, ...
متن کاملTiling Tripartite Graphs with 3-Colorable Graphs
For any positive real number γ and any positive integer h, there is N0 such that the following holds. Let N > N0 be such that N is divisible by h. If G is a tripartite graph with N vertices in each vertex class such that every vertex is adjacent to at least (2/3 + γ)N vertices in each of the other classes, then G can be tiled perfectly by copies of Kh,h,h. This extends the work in [Discrete Mat...
متن کاملAcyclically 3-Colorable Planar Graphs
In this paper we study the planar graphs that admit an acyclic 3-coloring. We show that testing acyclic 3-colorability is NP-hard, even for planar graphs of maximum degree 4, and we show that there exist infinite classes of cubic planar graphs that are not acyclically 3-colorable. Further, we show that every planar graph has a subdivision with one vertex per edge that admits an acyclic 3-colori...
متن کامل3-colorable subclasses of P8-free graphs
In this paper, we study 3-colorable graphs having no induced 8-vertex path and no induced cycles of specific lengths. We prove a characterization by critical graphs in three particular cases.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1997
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00182-3